Sub-optimal Decoding of Block and Lattice Codes
نویسندگان
چکیده
W e presen t several bounded distance decoding algor i t h m s f o r a f a m i l y of block codes T h e s e algorithms can be e f i c zen t l y employed f o r decoding lattice codes A thorough anvestzgatzon of t he performance and deczs ion regrons of t he proposed algorzthms are performed T h e s e suggest t h a t there are three dzstznct types of nearest nezghbors classzjied accordzng to thezr affect o n the deczszon region.
منابع مشابه
An Optimal Two-Stage Decoding Algorithm for Linear Block Codes
A new optimal two stages decoding algorithm for linear block codes is presented. At first stage, the minimum sufficient test set Ŝ is estimated. With the minimum sufficient test set, decoding complexity can be greatly reduced while maintaining the optimal performance. At the second stage, ordered processing is performed over the estimated minimum sufficient test set Ŝ to find the optimal soluti...
متن کاملInteger Forcing: Effective SNR Distribution and Practical Block-Based Schemes
Integer Forcing (IF) is a novel linear receiver architecture, where instead of separating the codewords sent by each transmitter, and decoding them individually, forces integer-valued linear combinations at each receive antenna, and decodes the linear combinations. The original codewords are obtained by inverting the integer-valued matrix. While demonstrating superior performance, IF requires c...
متن کاملA new lattice decoding for space time block codes with low complexity
We present an algorithm based on the closest point search (CPS) in lattices for decoding of space-time block codes (STBC). The modified CPS algorithm based on the Schnorr-Euchner variation of the Pohst method is used to perform the decoding of STBC. This method is shown to be substantially faster than other known sphere decoding methods. Also we exploit a fast method for decoding of orthogonal ...
متن کاملOn the Role of MMSE in Lattice Decoding: Achieving the Optimal Diversity-vs-Multiplexing Tradeoff
In this paper, we introduce the class of lattice space-time codes as a generalization of linear dispersion (LD) coding. We characterize the diversity-vs-multiplexing tradeoff achieved by random lattice coding with lattice decoding. This characterization establishes the optimality of lattice vertical codes when coupled with lattice decoding. We then generalize Erez and Zamir mod-Λ construction t...
متن کاملDecoding of Block and Convolutional Codes in Rank Metric DISSERTATION
Rank-metric codes recently attract a lot of attention due to their possible application to network coding, cryptography, space-time coding and distributed storage. An optimal-cardinality algebraic code construction in rank metric was introduced some decades ago by Delsarte, Gabidulin and Roth. This Reed–Solomon-like code class is based on the evaluation of linearized polynomials and is nowadays...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004